t-Pebbling and Extensions
نویسندگان
چکیده
We give upper bounds on t-pebbling numbers of graphs of small diameter and investigate the relationships between these results and those relating to fractional pebbling. Furthermore, we present a connection between optimal pebbling and linear optimization and utilize this relationship in analyzing various graphs. We introduce the optimal fractional pebbling number of a graph and provide a combinatorial interpretation. Finally, we explore a generalization of graph pebbling by allowing the target to be any distribution of a given size.
منابع مشابه
t-Pebbling Number of Some Multipartite Graphs
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent to v. A graph is called pebbleable if for each vertex v there is a sequence of pebbling moves that would place at least one pebble on v. The pebbling number of a graph G, is the smallest integer m such that G is pebblea...
متن کاملOptimal pebbling in products of graphs
We prove a generalization of Graham’s Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal t-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5. Finally, we present explicit distributions which provide a...
متن کاملOpen Problems #21 Graph Pebbling
Tom Trotter of Arizona State has settled Gra-ham Brightwell's problem about fractional dimension posed in Open Problems #20. Recall that the fractional dimension dim (P) is the minimum total weight assigned to the linear extensions of P so that each ordered incomparable pair is covered with total weight at least 1. Brightwell asked whether there exists a function f such that every n-element pos...
متن کاملThe Pi-Pebbling Function
Recent research in graph pebbling has introduced the notion of a cover pebbling number. Along this same idea, we develop a more general pebbling function π P (G). This measures the minimum number of pebbles needed to guarantee that any distribution of them on G can be transformed via pebbling moves to a distribution with pebbles on t target vertices. Furthermore, the P part of the function give...
متن کاملThe t-Pebbling Number is Eventually Linear in t
In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The t-pebbling number πt(G) of a graph G is the smallest m such that for every initial distribution of m pebbles on V (G) and every target vertex x there exists a sequence of pebbling moves leading t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2013